Competitive On-line Scheduling of Continuous-Media Streams

Competitive On-line Scheduling of Continuous-Media Streams

Multimedia applications require a guaranteed level of service for accessing continuous-media data. To obtain such guarantees, the database server where the data are residing must employ an admission control scheme to limit the number of clients that can be served concurrently. We investigate the problem of on-line admission control, where the decision of whether to accept or reject a request mu...

Online Scheduling of Continuous Media Streams

We present a model for an interactive continuous media server. Such server systems work in an online environment without knowing future requirements of the customers. We apply competitive analysis to study diierent scenarios of the design and control of a server and we give upper and lower bounds for the competitive ratio.

Competitive On-Line Scheduling of Imprecise Computations

The on-line scheduling of systems of imprecisecomputation tasks is investigated. The system objective is to maximize the value obtained. A formal model is de ned. Under certain reasonable assumptions | formalized here as the weak feasible mandatory constraint | a 2-competitive on-line scheduling algorithm is presented for the commonly studied uniform-density task systems. It is proven, however,...

Synchronization of Live Continuous Media Streams

One of the major problems in networked multimedia is the playout synchronization of continuous media streams. The sink of a set of transmitted media streams has to reestablish the presentation timing of samples within each stream (intra-stream synchronization) and among streams (inter-stream synchronization). In applications that include live human-to-human conversation there is the additional ...

Competitive On - Line Stream Merging Algorithmsfor Media - on - Demand